The Two-Processor Scheduling Problem is in Random NC
نویسندگان
چکیده
منابع مشابه
Two Processor Scheduling is in NC
WC prcsc~~t a parallcl dgorithm for tlic two processor scheduling problem. with iLrbit,rnry prccctl~~~cc constraints lluillg a polynorhd II~I~I~~HX of processors and for the problem luadc cxtcnsivc USC of randomization, our algorithm is complctcly dctcrkuistic and bnscd 011 rln intercsling dccomposi t i o n tcchuique. indcpcntlcnt rclcvarice for two more rcasous. And it is of It provides anothe...
متن کاملThe Polynomially Bounded Perfect Matching Problem Is in NC 2
The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent open questions in complexity theory regarding parallel computations. Grigoriev and Karpinski [GK87] studied the perfect matching problem for bipartite graphs with polynomially bounded permanent. They showed that for such bipartite ...
متن کاملRandom gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem
this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES (is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is ...
متن کاملA Two-Stage Hybrid Flowshop Scheduling Problem with Serial Batching
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...
متن کاملThe nc-Unique Shortest Vector Problem is Hard
The unique Shortest Vector Problem (uSVP) gained prominence because it was the problem upon which the first provably-secure lattice-based cryptosystems were built. But it was an open problem as to whether uSVP was as hard as the standard, more general, version of the shortest vector problem. We show that there is a reduction from the approximate decision version of the shortest vector problem (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1989
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0218076